A comparison of standard spell checking algorithms and a novel binary neural approach

In this paper, we propose a simple, flexible, and efficient hybrid spell checking methodology based upon phonetic matching, supervised learning, and associative matching in the AURA neural system. We integrate Hamming Distance and n-gram algorithms that have high recall for typing errors and a phonetic spell-checking algorithm in a single novel architecture. Our approach is suitable for any spell checking application though aimed toward isolated word error correction, particularly spell checking user queries in a search engine. We use a novel scoring scheme to integrate the retrieved words from each spelling approach and calculate an overall score for each matched word. From the overall scores, we can rank the possible matches. In this paper, we evaluate our approach against several benchmark spellchecking algorithms for recall accuracy. Our proposed hybrid methodology has the highest recall rate of the techniques evaluated. The method has a high recall rate and low-computational cost

A binary neural k-nearest neighbour technique

K-Nearest Neighbour (k-NN) is a widely used technique for classifying and clustering data. K-NN is effective but is often criticised for its polynomial run-time growth as k-NN calculates the distance to every other record in the data set for each record in turn. This paper evaluates a novel k-NN classifier with linear growth and faster run-time built from binary neural networks. The binary neural approach uses robust encoding to map standard ordinal, categorical and real-valued data sets onto a binary neural network. The binary neural network uses high speed pattern matching to recall the k-best matches. We compare various configurations of the binary approach to a conventional approach for memory overheads, training speed, retrieval speed and retrieval accuracy. We demonstrate the superior performance with respect to speed and memory requirements of the binary approach compared to the standard approach and we pinpoint the optimal configurations

Hierarchical growing cell structures: TreeGCS

We propose a hierarchical clustering algorithm (TreeGCS) based upon the Growing Cell Structure (GCS) neural network of Fritzke. Our algorithm refines and builds upon the GCS base, overcoming an inconsistency in the original GCS algorithm, where the network topology is susceptible to the ordering of the input vectors. Our algorithm is unsupervised, flexible, and dynamic and we have imposed no additional parameters on the underlying GCS algorithm. Our ultimate aim is a hierarchical clustering neural network that is both consistent and stable and identifies the innate hierarchical structure present in vector-based data. We demonstrate improved stability of the GCS foundation and evaluate our algorithm against the hierarchy generated by an ascendant hierarchical clustering dendogram. Our approach emulates the hierarchical clustering of the dendogram. It demonstrates the importance of the parameter settings for GCS and how they affect the stability of the clustering

A survey of outlier detection methodologies

Outlier detection has been used for centuries to detect and, where appropriate, remove anomalous observations from data. Outliers arise due to mechanical faults, changes in system behaviour, fraudulent behaviour, human error, instrument error or simply through natural deviations in populations. Their detection can identify system faults and fraud before they escalate with potentially catastrophic consequences. It can identify errors and remove their contaminating effect on the data set and as such to purify the data for processing. The original outlier detection methods were arbitrary but now, principled and systematic techniques are used, drawn from the full gamut of Computer Science and Statistics. In this paper, we introduce a survey of contemporary techniques for outlier detection. We identify their respective motivations and distinguish their advantages and disadvantages in a comparative review

An evaluation of standard retrieval algorithms and a binary neural approach

In this paper we evaluate a selection of data retrieval algorithms for storage efficiency, retrieval speed and partial matching capabilities using a large Information Retrieval dataset. We evaluate standard data structures, for example inverted file lists and hash tables, but also a novel binary neural network that incorporates: single-epoch training, superimposed coding and associative matching in a binary matrix data structure. We identify the strengths and weaknesses of the approaches. From our evaluation, the novel neural network approach is superior with respect to training speed and partial match retrieval time. From the results, we make recommendations for the appropriate usage of the novel neural approach. (C) 2001 Elsevier Science Ltd. All rights reserved

Examining the validity of the Athlete Engagement Questionnaire (AEQ) within a Portuguese sport setting

Sport psychology literature suggests that understanding engagement levels is pivotal to promote positive sporting experiences among athletes. The purpose of this study was to examine the psychometric properties of the Athlete Engagement Questionnaire among Portuguese sport athletes. Two distinct samples of Portuguese athletes from different competitive levels were collected, and the results of a confirmatory factor analysis demonstrated a good fit of the model to the data. A review of the psychometric properties indicated that all factors showed good composite reliability, convergent validity, and discriminant validity. In addition, a multi-groups analysis showed the invariance of the model in two independent samples providing evidence of cross validity. Implications of these results for scholars and coaches are discussed and guidelines for future studies are suggested

Results Of A Genome-wide Genetic Screen For Panic Disorder

Panic disorder is characterized by spontaneous and recurrent panic attacks, often accompanied by agoraphobia. The results of family, twin, and segregation studies suggest a genetic role in the etiology of the illness. We have genotyped up to 23 families that have a high density of panic disorder with 540 microsatellite DNA markers in a first-pass genomic screen. The thirteen best families (ELOD > 6.0 under the dominant genetic model) have been genotyped with an ordered set of markers encompassing all the autosomes, at an average marker density of 11 cM. Over 110,000 genotypes have been generated on the whole set of families, and the data have been analyzed under both a dominant and a recessive model, and with the program SIBPAIR. No lod scores exceed 2.0 for either parametric model. Two markers give lod scores over 1.0 under the dominant model (chromosomes 1p and 20p), and four do under the recessive model (7p, 17p, 20q, and X/Y). One of these (20p) may be particularly promising. Analysis with SIBPAIR yielded P values equivalent to a lod score of 1.0 or greater (i.e., P < .016, one-sided, uncorrected for multiple tests) for 11 marker loci (2, 7p, 8p, 8q, 9p, 11q, 12q, 16p, 20p and 20q)

All-sky search for long-duration gravitational wave transients with initial LIGO

We present the results of a search for long-duration gravitational wave transients in two sets of data collected by the LIGO Hanford and LIGO Livingston detectors between November 5, 2005 and September 30, 2007, and July 7, 2009 and October 20, 2010, with a total observational time of 283.0 days and 132.9 days, respectively. The search targets gravitational wave transients of duration 10-500 s in a frequency band of 40-1000 Hz, with minimal assumptions about the signal waveform, polarization, source direction, or time of occurrence. All candidate triggers were consistent with the expected background; as a result we set 90% confidence upper limits on the rate of long-duration gravitational wave transients for different types of gravitational wave signals. For signals from black hole accretion disk instabilities, we set upper limits on the source rate density between 3.4×10-5 and 9.4×10-4 Mpc-3 yr-1 at 90% confidence. These are the first results from an all-sky search for unmodeled long-duration transient gravitational waves. © 2016 American Physical Society

All-sky search for long-duration gravitational wave transients with initial LIGO

We present the results of a search for long-duration gravitational wave transients in two sets of data collected by the LIGO Hanford and LIGO Livingston detectors between November 5, 2005 and September 30, 2007, and July 7, 2009 and October 20, 2010, with a total observational time of 283.0 days and 132.9 days, respectively. The search targets gravitational wave transients of duration 10-500 s in a frequency band of 40-1000 Hz, with minimal assumptions about the signal waveform, polarization, source direction, or time of occurrence. All candidate triggers were consistent with the expected background; as a result we set 90% confidence upper limits on the rate of long-duration gravitational wave transients for different types of gravitational wave signals. For signals from black hole accretion disk instabilities, we set upper limits on the source rate density between 3.4×10-5 and 9.4×10-4 Mpc-3 yr-1 at 90% confidence. These are the first results from an all-sky search for unmodeled long-duration transient gravitational waves. © 2016 American Physical Society

A binary neural shape matcher using Johnson Counters and chain codes

Images may be matched as whole images or using shape matching. Shape matching requires: identifying edges in the image, finding shapes using the edges and representing the shapes using a suitable metric. A Laplacian edge detector is simple and efficient for identifying the edges of shapes. Chain codes describe shapes using sequences of numbers and may be matched simply, accurately and flexibly. We couple this with the efficiency of a binary associative-memory neural network. We demonstrate shape matching using the neural network to index and match chain codes where the chain code elements are represented by Johnson codes